Secure Software Leasing Without Assumptions

نویسندگان

چکیده

Quantum cryptography is known for enabling functionalities that are unattainable using classical information alone. Recently, Secure Software Leasing (SSL) has emerged as one of these areas interest. Given a target circuit $C$ from class, SSL produces an encoding enables recipient to evaluate $C$, and also the originator software verify been returned -- meaning relinquished possibility any further use software. Clearly, such functionality unachievable alone, since it impossible prevent user keeping copy Recent results have shown achievability quantum class functions called compute-and-compare (these generalization well-known point functions). These prior works, however all make setup or computational assumptions. Here, we show achievable circuits without Our technique involves study copy-protection, which notion related SSL, but where procedure inherently prevents would-be pirate splitting single into two parts, each $C$. We can be copy-protected assumptions, novel security definition involving honest malicious evaluator; this achieved by showing message authentication code, derive honest-malicious copy-protection scheme. then generic scheme implies SSL; work, yields functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumptions. In this paper we provide the first general construction of secure multi-party computation protocol without any setup that guarantees composable security in the presence of an adaptive adversar...

متن کامل

On pseudorandomization of information-theoretically secure schemes without hardness assumptions

A recent work by Nuida and Hanaoka (in ICITS 2009) provided a proof technique for security of information-theoretically secure cryptographic schemes in which the random input tape is implemented by a pseudorandom generator (PRG). In this paper, we revisit their proof technique and generalize it by introducing some trade-off factor, which involves the original proof technique as a special case a...

متن کامل

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions and is the first to be proven secure in a concurrent setting (under any assumptions) without random oracles or a trusted setup assumption such as a common reference string. Along the way, we also introduce n...

متن کامل

Secure Computation from Hardware Assumptions

of the Dissertation Secure Computation from Hardware Assumptions

متن کامل

Protocols for Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions

Until recently, most research on the topic of secure computation focused on the stand-alonemodel, where a single protocol execution takes place. In this paper, we construct protocolsfor the setting of bounded-concurrent self composition, where a (single) secure protocol is runmany times concurrently, and there is a predetermined bound on the number of concurrentexecutions. In sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-90459-3_4